Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes

This work analyzes the latency of simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional decoding, where linear in block length, SSC sublinear. More specifically, O(N 1-1/μ ), N length μ scaling exponent channel, which captures speed convergence rate to capacity. Numerical results demonstrate tightness bound show that most reduction arises from parallel subcodes 0 or 1.